Compact lattice U(1) and Seiberg–Witten duality
نویسندگان
چکیده
منابع مشابه
Compact lattice U(1) and Seiberg-Witten duality
Simulations in compact U(1) lattice gauge theory in 4D show now beyond any reasonable doubts that the phase transition separating the Coulomb from the confined phase is of first order, albeit a very weak one. This settles the issue from the numerical side. On the analytical side, it was suggested some time ago, based on the qualitative analogy between the phase diagram of such a model and the o...
متن کاملCompact lattice U(1) and Seiberg-Witten duality: a quantitative comparison
It was conjectured some time ago that an effective description of the Coulombconfinement transition in compact U(1) lattice gauge field theory could be described by scalar QED obtained by soft breaking of the N = 2 Seiberg-Witten model down to N = 0 in the strong coupling region where monopoles are light. In two previous works this idea was presented at a qualitative level. In this work we anal...
متن کامل2-Lattice Polyhedra: Duality
This is the first in a series of papers that explores a class of polyhedra we call 2-lattice polyhedra. 2-Lattice polyhedra are a special class of lattice polyhedra that include network flow polyhedra, fractional matching polyhedra, matroid intersection polyhedra, the intersection of two polymatroids, etc. In this paper we show that the maximum sum of components of a vector in a 2-lattice polyh...
متن کاملTannaka-krein Duality for Compact Groupoids Iii, Duality Theory
This is the last in a series of papers in which we generalized the Tannaka-Krein duality to compact groupoids. In [A1] we studied the representation theory of compact groupoids. In particular, we showed that irreducible representations have finite dimensional fibres. We also proved the Schur’s lemma, Gelfand-Raikov theorem and Peter-Weyl theorem for compact groupoids. In [A2] we studied the Fou...
متن کاملParametric Analysis, Duality, and Lattice Polytopes ?
We study the parameter space decomposition induced by parametric optimization problems where the score of each feasible solution is a linear function with integer coefficients. We show that for a large class of problems the number of regions in the decomposition is polynomial in the length of the input. The proof uses geometric duality and a classical result on lattice polytopes. We apply the r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physics Letters B
سال: 2003
ISSN: 0370-2693
DOI: 10.1016/s0370-2693(03)00178-3